Collision Detection with Glide Rotations
نویسنده
چکیده
We introduce a framework for collision detection between a pair of rigid polyhedra. Given the initial and final positions and orientations of two objects, the algorithm determines whether the bodies collide, and if so, when and where. All the collisions, including collisions at different times are computed at once. This kind of collision information is useful for handling multiple (nearly) concurrent contact points and for real-time applications such as computer games. The relative motions of the rigid body is limited to glide rotation (i.e., screw motion). This limitation is not always completely accurate, but we give bounds on the error introduced by the assumption. Our implementation uses pixelization to approximate the position and time of the collisions. This allows level-of-detail techniques that provide a tradeoff between accuracy and computational expense. The collision detection algorithms are only approximate, both because of the glide rotation limitation and because of the pixelization. However, they can be made quite robust for rigid bodies so as to always give consistent information about collisions and to avoid sensitivity to roundoff errors.
منابع مشابه
Modellingmotion Planning Withmany Degrees of Freedom Heuristically
We present a heuristic approach to the geometric motion-planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide -and-conquer path search strategy, which makes inquiries about feasible paths, an efficient collision detection scheme is developed that handles translations and rotations of polyhedral to compute all times of collision. The whole algorithm ...
متن کاملHeuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search strategy which makes inquiries about feasible paths; to answer these, we develop an efficient collision detection scheme that handles translations and rotations of polyhedra to compute all times of collision. The whol...
متن کاملThree Vector Generation of Crystal Space Groups in Geometric Algebra
This paper focuses on the symmetries of crystal space lattices. All two dimensional (2D) and three dimensional (3D) point groups of 2D and 3D crystal cells are exclusively described by vectors (two in 2D, three in 3D for one particular cell) taken from the physical cells. Geometric multiplication of these vectors completely generates all symmetries, including reflections, rotations, inversions,...
متن کاملExact Geometric Collision Detection
Exact computation is an important paradigm for the implementation of geometric algorithms. In this paper, we consider for the first time the practically important problem of collision detection under this aspect. The task is to decide whether a polyhedral object can perform a prescribed sequence of translations and rotations in the presence of stationary polyhedral obstacles. We present an exac...
متن کاملThomsen's Equation
1. INTRODUCTION. In plane Euclidean geometry reflections across lines are fundamental isometries. Every isometry is a composition of at most three such reflections. Compositions of two reflections are rotations or translations. Compositions of three are glide reflections. (For a thorough introduction to this area of geometry, see Smith [8, chap. 6].) This paper is about the reflections across e...
متن کامل